4 research outputs found
Panini -- Anonymous Anycast and an Instantiation
Anycast messaging (i.e., sending a message to an unspecified receiver) has
long been neglected by the anonymous communication community. An anonymous
anycast prevents senders from learning who the receiver of their message is,
allowing for greater privacy in areas such as political activism and
whistleblowing. While there have been some protocol ideas proposed, formal
treatment of the problem is absent. Formal definitions of what constitutes
anonymous anycast and privacy in this context are however a requirement for
constructing protocols with provable guarantees. In this work, we define the
anycast functionality and use a game-based approach to formalize its privacy
and security goals. We further propose Panini, the first anonymous anycast
protocol that only requires readily available infrastructure. We show that
Panini allows the actual receiver of the anycast message to remain anonymous,
even in the presence of an honest but curious sender. In an empirical
evaluation, we find that Panini adds only minimal overhead over regular
unicast: Sending a message anonymously to one of eight possible receivers
results in an end-to-end latency of 0.76s
PolySphinx: Extending the Sphinx Mix Format With Better Multicast Support
Mix networks are a well-known technique to hide communication metadata, but incur a high overhead especially in group communication settings. This hinders their adoption in real-world usage, as group communication makes up a big part of modern communication patterns. In this paper, we introduce "PolySphinx", a mix format that is a step towards efficient anonymous multicasting and allows a mix node to replicate the message payload to multiple recipients. We prove that PolySphinx does not compromise on the anonymity offered to users, while considerably reducing the latency of group messages: In a group with 25 members, the average latency drops from 6.1s using the state-of-the-art Rollercoaster approach to 4.1s using PolySphinx